#include <stdio.h>

int isPrime(int n);

int main() {
    int n, m;
    scanf("%d,%d", &n, &m);
    int count = 0, sum = 0;
    for (int i = n; i <= m; i++) {
        if (isPrime(i)) {
            count++;
            sum += i;
        }
    }
    printf("count=%d,sum=%d", count, sum);
}

int isPrime(int n) {
    if (n == 1) return 0;
    if (n == 2) return 1;
    if (n % 2 == 0) return 0;
    for (int i = 3; i * i <= n; i += 2) {
        if (n % i == 0) return 0;
    }
    return 1;
}